An agent-based parallel approach for the job shop scheduling problem with genetic algorithms
نویسندگان
چکیده
منابع مشابه
An agent-based parallel approach for the job shop scheduling problem with genetic algorithms
The job shop scheduling problem is one of themost important and complicated problems in machine scheduling. This problem is characterized as NP-hard. The high complexity of the problem makes it hard to find the optimal solution within reasonable time in most cases. Hence searching for approximate solutions in polynomial time instead of exact solutions at high cost is preferred for difficult ins...
متن کاملSolving the Job Shop Scheduling Problem Using Parallel Genetic Algorithms
Extended Abstract The purpose of this paper is to present a thorough empirical analysis regarding the robustness, effectiveness and efficiency of four distinct genetic algorithm templates on the well known Job Shop Scheduling Problem (JSSP). Its popularity has maintained this combinatorial problem in the academic foray for the past five decades attracting researchers from the fields of combinat...
متن کاملHybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage
In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...
متن کاملSolving the Job Shop Scheduling Problem with a Parallel and Agent-based Local Search Genetic Algorithm
Job shop scheduling problems play an important role in both manufacturing systems and industrial process for improving the utilization of resources, and therefore it is crucial to develop efficient scheduling technologies. The Job shop scheduling problem, one of the best known production scheduling problems, has been proved to be NP-hard. In this paper, we present a parallel and agent-based loc...
متن کاملJob shop scheduling problem with alternative machines using genetic algorithms
The classical job shop scheduling problem (JSP) is the most popular machine scheduling model in practice and is known as NP-hard. The formulation of the JSP is based on the assumption that for each part type or job there is only one process plan that prescribes the sequence of operations and the machine on which each operation has to be performed. However, JSP with alternative machines for vari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2010
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2010.04.019